The weight hierarchy of product codes
نویسنده
چکیده
The weight of a code is the number of coordinate positions where no codeword is zero. The th minimum weight is the least weight of an -dimensional subcode. Wei and Yang gave a conjecture about the minimum weights for some product codes. In this correspondence, we will find a relation between product codes and the Segre embedding of a pair of projective systems, and we use this to prove the conjecture.
منابع مشابه
A Lower Bound on the Greedy Weights of Product Codes
A greedy 1-subcode is a one-dimensional subcode of minimum (support) weight. A greedy r-subcode is an r-dimensional subcode with minimum support weight under the constraint that it contain a greedy (r − 1)-subcode. The r-th greedy weight er is the support weight of a greedy r-subcode. The greedy weights are related to the weight hierarchy. We use recent results on the weight hierarchy of produc...
متن کاملMonomial-like codes
Abstract. As a generalization of cyclic codes of length p over Fpa , we study n-dimensional cyclic codes of length p1 ×· · ·×pn over Fpa generated by a single “monomial”. Namely, we study multi-variable cyclic codes of the form 〈(x1 − 1) i1 · · · (xn − 1) n〉 ⊂ Fq [x1,...,xn] 〈x ps1 1 −1,...,x psn n −1〉 . We call such codes monomial-like codes. We show that these codes arise from the product of ...
متن کاملSelecting the Best Waste Disposal Method in Health Using Combined Method of Fuzzy Analytical Hierarchy Process and Fuzzy Weighted Aggregated Sum Product Assessment
Background and Aim: Inattention of hospital waste management has caused many problems. As a consequence, it has put the environment and human health at serious risk. Medical centers are one of the important health institutions which in recent years, population growth, increasing clients and service populations has led to significant growth in waste production in them. The quality and quantity o...
متن کاملGeneralized Reed - Muller Codes and Curves with Many Points
In the quest for curves over finite fields with many points coding theory has been a useful guide, as words of low weight in trace codes correspond to Artin-Schreier curves with many points. This correspondence can be extended to subcodes of low weight and fibre products of Artin-Schreier curves. Subcodes of minimum weight of a code C determine the weight hierarchy of C and knowledge of the wei...
متن کاملA Lower Bound on the Greedy Weights of Product Codes and Projective Multisets
We present the relation between product codes and projective multisets, and give a lower bound on the greedy weights of product codes. I. GREEDY WEIGHTS The weight hierarchy has received a lot of attention after Victor Wei's paper [5]. Let C be an [n, k ] linear code. The support of a codeword c E C is the set ~ ( c ) of non-zero coordinate positions. For a subcode D C we write x ( D ) = U c E ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 46 شماره
صفحات -
تاریخ انتشار 2000